An approximate algorithm for combinatorial optimization problems with two parameters

نویسندگان

  • David Blokh
  • Gregory Gutin
چکیده

We call a minimum cost restricted time combinatorial optimization (MCRT) problem any problem that has a finite set P, finite family S of subsets of P, non-negative threshold h, and two non-negative real-valued functions y : (say, cost) and x : p......-? R+ (say, time). One seeks a solution F* E S with y(F*) min{y(F): F E S, x(F):S h}, where x(G) L:gEGx(g), y(G) = L:gEGy(g) and G E S. We also assume that for the corresponding minimum cost problem there is an efficient exact or approximate algorithm. We describe a very simple approximate algorithm for any MCRT problem. Though our algorithm is not polynomial in general, we provide some evidence that the algorithm may be fairly fast in many cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

An optimization technique for vendor selection with quantity discounts using Genetic Algorithm

Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm

Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...

متن کامل

Negative Selection Based Data Classification with Flexible Boundaries

One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1996